Search results for "Delaunay Triangulation"
showing 10 items of 18 documents
Registration of Surfaces Minimizing Error Propagation for a One-Shot Multi-Slit Hand-Held Scanner
2008
We propose an algorithm for the on-line automatic registration of multiple 3D surfaces acquired in a sequence by a new hand-held laser scanner. The laser emitter is coupled with an optical lens that spreads the light forming 19 parallel slits that are projected to the scene and acquired with subpixel accuracy by a camera. Splines are used to interpolate the acquired profiles to increase the sample of points and Delaunay triangulation is used to obtain the normal vectors at every point. A point-to-plane pair-wise registration method is proposed to align the surfaces in pairs while they are acquired, conforming paths and eventually cycles that are minimized once detected. The algorithm is spe…
Index-based triangulation method for efficient generation of large three-dimensional ultrasonic C-scans
2018
The demand for high-speed ultrasonic scanning of large and complex components is driven by a desire to reduce production bottlenecks during the non-destructive evaluation (NDE) of critical parts. Emerging systems (including robotic inspection) allow for the collection of large volumes of data in short time spans, compared to existing inspection systems. To maximise throughput, it is crucial that the reconstructed inspection datasets are generated and evaluated rapidly without loss of detail. This requires new data visualisation and analysis tools capable of mapping complex geometries while guaranteeing full coverage. This paper presents an entirely new approach for the visualisation of thre…
Editing prototypes in the finite sample size case using alternative neighborhoods
1998
The recently introduced concept of Nearest Centroid Neighborhood is applied to discard outliers and prototypes 111 class overlapping regions in order to improve the performance of the Nearest Neighbor rule through an editing procedure, This approach is related to graph based editing algorithms which also define alternative neighborhoods in terms of geornetric relations, Classical editing algorithms are compared to these alternative editing schemes using several synthetic and real data problems. The empirical results show that, the proposed editing algorithm constitutes a good trade-off among performance and computational burden.
A new solver for incompressible non-isothermal flows in natural and mixed convection over unstructured grids
2022
Abstract In the present paper we propose a new numerical methodology for the solution of 2D non-isothermal incompressible flows for natural and mixed convection in irregular geometries. The governing equations are the Incompressible Navier-Stokes Equations and the Energy Conservation Equation. Fluid velocity and temperature are coupled in the buoyancy term of the momentum equations according to the Oberbeck–Boussinesq approximation. The governing equations are discretized over unstructured triangular meshes satisfying the Delaunay property. Thanks to the Oberbeck–Boussinesq hypothesis, the flow and energy problems are solved in an uncoupled way, and two fractional time step procedures are s…
SIFT Matching by Context Exposed
2023
This paper investigates how to step up local image descriptor matching by exploiting matching context information. Two main contexts are identified, originated respectively from the descriptor space and from the keypoint space. The former is generally used to design the actual matching strategy while the latter to filter matches according to the local spatial consistency. On this basis, a new matching strategy and a novel local spatial filter, named respectively blob matching and Delaunay Triangulation Matching (DTM) are devised. Blob matching provides a general matching framework by merging together several strategies, including rank-based pre-filtering as well as many-to-many and symmetri…
Constructing a Pareto front approximation for decision making
2011
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes are developed and applying the rules is demonstrated with examples. The quality of the approximation is quantified with error estimates. Due to its properties, the Pareto front approximation works as a surrogate to the original problem for decision making with interactive methods. Qc 20120127
Skeletizing 3D-Objects by Projections
2004
Skeletization is used to simplify an object and to give an idea of the global shape of an object. This paper concerns the continuous domain. While many methods already exist, they are mostly applied in 2D-space. We present a new method to skeletize the polygonal approximation of a 3D-object, based on projections and 2D-skeletization from binary trees.
Monotonic solution of flow and transport problems in heterogeneous media using Delaunay unstructured triangular meshes
2013
Transport problems occurring in porous media and including convection, diffusion and chemical reactions, can be well represented by systems of Partial Differential Equations. In this paper, a numerical procedure is proposed for the fast and robust solution of flow and transport problems in 2D heterogeneous saturated media. The governing equations are spatially discretized with unstructured triangular meshes that must satisfy the Delaunay condition. The solution of the flow problem is split from the solution of the transport problem and it is obtained with an approach similar to the Mixed Hybrid Finite Elements method, that always guarantees the M-property of the resulting linear system. The…
MAST-2D diffusive model for flood prediction on domains with triangular Delaunay unstructured meshes
2011
Abstract A new methodology for the solution of the 2D diffusive shallow water equations over Delaunay unstructured triangular meshes is presented. Before developing the new algorithm, the following question is addressed: it is worth developing and using a simplified shallow water model, when well established algorithms for the solution of the complete one do exist? The governing Partial Differential Equations are discretized using a procedure similar to the linear conforming Finite Element Galerkin scheme, with a different flux formulation and a special flux treatment that requires Delaunay triangulation but entire solution monotonicity. A simple mesh adjustment is suggested, that attains t…
Monotonic solution of heterogeneous anisotropic diffusion problems
2013
Anisotropic problems arise in various areas of science and engineering, for example groundwater transport and petroleum reservoir simulations. The pure diffusive anisotropic time-dependent transport problem is solved on a finite number of nodes, that are selected inside and on the boundary of the given domain, along with possible internal boundaries connecting some of the nodes. An unstructured triangular mesh, that attains the Generalized Anisotropic Delaunay condition for all the triangle sides, is automatically generated by properly connecting all the nodes, starting from an arbitrary initial one. The control volume of each node is the closed polygon given by the union of the midpoint of…